Informatics Publishing Limited

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, D. Aswini ⁴

Affiliations
1 IT Department, Kumaraguru College of Technology, Coimbatore - 641 049, IN
2 INFO Institute of Engineering, Coimbatore - 641 007, IN
3 CSE Department, Government College of Technology, Coimbatore - 641 013, IN
4 Kumaraguru College of Technology, Coimbatore-641 049, IN

Abstract

Wireless Sensor Networks (WSNs) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, and to cooperatively pass their data through the network to a base station. Data Fusion/Aggregation can effectively reduce the volume of data transmission in the network, reduce the energy consumption to extend network lifetime and improve bandwidth utilization, as a result, it can overcome the restriction of energy and bandwidth. Moreover since a sensor is typically placed in locations that are accessible to malicious attackers, information assurance of the data fusion process is very important. In order to improve the performance in terms of assurance, overhead and delay, we proposed a novel trust based direct voting mechanism [1]. Our work employs trust metric to poll the witness nodes for in the process of data fusion assurance. In this paper we extended the work of [1] in terms of bottom-up approach where the child node can select the node (parent) to forward the data. Generally, a hierarchical data collection scheme is used by the sensors to report data to the base station, it is difficult to precisely identify and eliminate a compromised node in such a data collecting hierarchy. Most security schemes for sensor networks focuses on developing mechanism for nodes located higher in the hierarchy to monitor those located at lower levels. We propose a complementary mechanism with which the nodes at lower levels can monitor their parents in the hierarchy to identify the behavior, based on that child will select the parent node to forward the data. Every node maintains a reputation (trust) value of its parent and updates this at the end of every data reporting cycle. We propose a novel combination of statistical testing techniques and reinforcement learning schemes to manage the reputation of a parent node. In this paper baye’s theorem is used to evaluate the trust of nodes. The performance of proposed approach is evaluated and compared with previous approaches and found that our approach has a lower overhead than the previous approaches in terms of delay and energy consumption.

Keywords

Wireless Sensor Networks, Data Fusion Assurance, Power-Efficient, Voting Mechanism, Witness Node, Bottom-Up Approach, Reputation.

Full Text

     

N. Chitradevi ¹, V. Palanisamy ², K. Baskaran ³, S. Prabeela ⁴

Affiliations
1 Department of Information Technology, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN
2 Department of Electronics and Communication Engineering, INFO Institute of Engineering, Coimbatore, Tamil Nadu, IN
3 Department of Computer Science and Engineering, Government College of Technology, Coimbatore, Tamil Nadu, IN
4 Department of Computer Science and Engineering, Kumaraguru College of Technology, Coimbatore, Tamil Nadu, IN

Abstract

Wireless sensor networks allow distributed sensing and forwarding of data co-operatively during energy efficient operations. Sensor nodes in this network are small and inexpensive, so that they can be produced and deployed in large numbers, and so their resources in terms of energy, memory, computational speed and bandwidth are severely constrained. The information processing algorithms in wireless sensor networks must also use reduced computing power of the sensor networks Critical resource limitations like power constraints demands energy efficient data gathering schemes. Data aggregation, eliminating data redundancy is an efficient data gathering scheme. Cluster analysis, primitive exploration with little or no prior knowledge is an efficient data aggregation scheme. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. This paper provides a more detailed look at some of the existing data clustering algorithms used in wireless sensor networks.

Keywords

Clustering, Clustering Algorithm, Energy Minimization, Unsupervised Technique, Wireless Sensor Network.

Full Text